Bounds on File Delivery Delay in an Infostations System

The infostations system consists of high speed radios transmitting to very small and discontinuous cells. In this paper we investigate the problem of delivering information in a system where the data rate between the infostations and the fixed network is low compared to the radio rate. This situation is the reverse of the usual wireless network model. We approach this problem assuming that deliveries can be made selectively to infostations along a user path and derive bounds on minimum delivery delay for a variety of infostations geometries. We also provide a near-optimum (minimum delay) algorithm for file delivery.